Search results

bktree-fast

As an example, a common strategy for de-duplicating images is to compute perceptual hashes for each of the images and compare those hashes with each other. Such hashes are small compared with the images (often 32, 64, 128 bits). If the hashing function is

• hamming
• tree
• BK
• hash
• perceptual

hexten

published 0.0.7 • 4 years agopublished 0.0.7 4 years ago